Method and apparatus for query-based congestion control

ABSTRACT

An electronic device may be operable to communicate over a physical medium and to regulate the transmission of a message onto the physical medium. The device may access the medium in accordance with a CSMA scheme, wherein one or more values of one or more CSMA parameters may be determined based on the result of a comparison of a received search token to data stored in the communication device. The message may be a response to a received request message, and the search token may have been received in the request message. A value of the CSMA parameter(s) may be determined based on the result of a comparison of the score and one or more thresholds. The threshold(s) may have been received in the request message. The value(s) of the CSMA parameter(s) may be determined based on one or more initial values contained in the received request message.

CLAIM OF PRIORITY

This patent application is a continuation of U.S. patent application Ser. No. 15/653,937, filed on Jul. 19, 2017, which is a continuation of U.S. patent application Ser. No. 15/231,098, filed on Aug. 8, 2016, which is a continuation of U.S. patent application Ser. No. 14/537,178, filed on Nov. 10, 2014, which is a continuation of U.S. patent application Ser. No. 13/408,464, filed on Feb. 29, 2012, now U.S. Pat. No. 8,885,586, which makes reference to, claims priority to and claims benefit from U.S. Provisional Patent Application Ser. No. 61/464,376, entitled “Advanced Communication System for Wide-area Low Power Wireless Applications and Active RFID” and filed on Mar. 2, 2011, now expired.

Each of the above-referenced applications is hereby incorporated herein by reference in its entirety.

INCORPORATION BY REFERENCE

This patent application also makes reference to:

-   U.S Provisional Patent Application Ser. No. 61/464,376 titled     “Advanced Communication System for Wide-Area Low Power Wireless     Applications and Active RFID” and filed on Mar. 2, 2011, now     expired; -   U.S. Provisional Patent Application Ser. No. 61/572,390 titled     “System for Adding Dash?-Based Applications Capability to a     Smartphone” and filed on Jul. 15, 2011, now expired; -   U.S. patent application Ser. No. 13/267,640 titled “Method and     Apparatus for Adaptive Searching of Distributed Datasets” and filed     on Oct. 6, 2011; -   U.S. patent application Ser. No. 13/267,621 titled “Method and     Apparatus for Low-Power, Long-Range Networking” and filed on Oct. 6,     2011; -   U.S. Pat. No. 8,718,551 titled “Method and Apparatus for a     Multi-band, Multi-mode Smartcard” and filed on Oct. 11, 2011; -   U.S. patent application Ser. No. 13/270,959 titled “Method and     Apparatus for an Integrated Antenna” and filed on Oct. 11, 2011; -   U.S. patent application Ser. No. 13/289,054 titled “Method and     Apparatus for Electronic Payment” and filed on Nov. 4, 2011; -   U.S. patent application Ser. No. 13/289,050 filed on Nov. 4, 2011; -   U.S. Pat. No. 8,622,312 titled “Method and Apparatus for Interfacing     with a Smartcard” and filed on Nov. 16, 2011; -   U.S. patent application Ser. No. 13/354,513 titled “Method and     Apparatus for Memory Management” and filed on Jan. 20, 2012; -   U.S. patent application Ser. No. 13/354,615 titled “Method and     Apparatus for Discovering, People, Products, and/or Services via a     Localized Wireless Network” and filed on Jan. 20, 2012; -   U.S. patent application Ser. No. 13/396,708 titled “Method and     apparatus for Plug and Play, Networkable ISO 18000-7 Connectivity”     and filed on Feb. 15, 2012; -   U.S. patent application Ser. No. 13/396,739 titled “Method and     Apparatus for Serving Advertisements in a Low-Power Wireless     Network” and filed on Feb. 15, 2012; -   U.S. patent application Ser. No. 13/408,440 titled “Method and     Apparatus for Forward Error Correction (FEC) in a     Resource-Constrained Network” and filed on Feb. 29, 2012; -   U.S. Pat. No. 8,867,370 titled “Method and Apparatus for Adaptive     Traffic Management in a Resource-Constrained Network” and filed on     Feb. 29, 2012; -   U.S. patent application Ser. No. 13/408,453 titled “Method and     Apparatus for Dynamic Media Access Control in a Multiple Access     System” and filed on Feb. 29, 2012; -   U.S. Pat. No. 8,774,096 titled “Method and Apparatus for Rapid Group     Synchronization” and filed on Feb. 29, 2012; -   U.S. patent application Ser. No. 13/408,461 titled “Method and     Apparatus for Addressing in a Resource-Constrained Network” and     filed on Feb. 29, 2012; and -   U.S. patent application Ser. No. 13/408,466 titled “Method and     Apparatus for Power Autoscaling in a Resource-Constrained Network”     and filed on Feb. 29, 2012.

Each of the above stated applications is hereby incorporated herein by reference in its entirety.

FIELD OF THE INVENTION

Certain embodiments of the invention relate to networking. More specifically, certain embodiments of the invention relate to a method and apparatus for query-based congestion control.

BACKGROUND OF THE INVENTION

Existing methods of congestion control in wireless networks often result in inefficient use of bandwidth and/or power. Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.

BRIEF SUMMARY OF THE INVENTION

A system and/or method is provided for query-based congestion control, substantially as illustrated by and/or described in connection with at least one of the figures, as set forth more completely in the claims.

These and other advantages, aspects and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts exemplary communication devices which may be operable to implement query-based congestion control.

FIG. 2 is a diagram illustrating aspects of the invention taking place at different layers of the OSI model.

FIG. 3 is a flowchart illustrating exemplary steps for query-based congestion control.

FIGS. 4A and 4B are a flowchart illustrating the use of carrier sense multiple access (CSMA) for implementing query-based congestion control.

FIG. 4C is a flowchart illustrating query-based calculation of timing parameters for accessing a shared medium.

FIGS. 5A-5E illustrate an exemplary dialog between network devices utilizing query-based congestion control.

DETAILED DESCRIPTION OF THE INVENTION

As utilized herein the terms “circuits” and “circuitry” refer to physical electronic components (i.e. hardware) and any software and/or firmware (“code”) which may configure the hardware, be executed by the hardware, and or otherwise be associated with the hardware. As utilized herein, “and/or” means any one or more of the items in the list joined by “and/or”. As an example, “x and/or y” means any element of the three-element set {(x), (y), (x, y)}. As another example, “x, y, and/or z” means any element of the seven-element set {(x), (y), (z), (x, y), (x, z), (y, z), (x, y, z)}. As utilized herein, the terms “block” and “module” refer to functions than can be implemented in hardware, software, firmware, or any combination of one or more thereof. As utilized herein, the term “exemplary” means serving as a non-limiting example, instance, or illustration. As utilized herein, the terms “e.g.,” and “for example,” introduce a list of one or more non-limiting examples, instances, or illustrations.

FIG. 1 depicts exemplary communication devices which may be operable to implement query-based congestion control. Shown in FIG. 1 are details of an exemplary first device 102 and details of an exemplary second device 104.

The CPU 204 may comprise circuitry operable to control operation of the first device 102. The CPU 204 may, for example, execute an operating system and/or other programs such (e.g., programs that enable a user interface of the device 102). The CPU 204 may generate one or more control signals for controlling the operation of the device 102. The CPU 204 may, for example, control a mode of operation of the device 102.

The CPU 214 may comprise circuitry operable to control operation of the second device 104. In some instances, the CPU 214 may be substantially similar to the CPU 204. In instances that the device 102 is less resource-constrained device, such as a base station or network controller, and the device 104 is more resource-constrained device, such as a battery-powered tag, the CPU 204 may be less-complex (e.g., comprise fewer gates, utilize less power, utilize less memory, etc.) than the CPU 214. In one embodiment, for example, the CPU 204 may comprise a RISC or ARM processor, and the CPU 214 may comprise a state-machine having a relatively small number of states (e.g., four states).

The radio 207 may comprise a processor 208 and an analog front-end (AFE) 209. The processor 208 may comprise circuitry operable to interface with the AFE 209 to receive and transmit data, and to process received and to-be-transmitted data. For transmission, the processor 208 may be operable to receive data from the CPU 204 and/or memory 206, encode, packetize, and/or otherwise process the data to prepare it for transmission in accordance with one or more wireless protocols, and output the data to the AFE 209 for transmission. For reception, the processor 208 may be operable to receive data via the AFE 209, process the received data and output received data to the memory 206 and/or the CPU 204. Exemplary protocols which may be supported by the second device 104 include the ISO 18000-7 standard, and protocols described in the above-incorporated U.S. Provisional Patent Application No. 61/464,376 filed on Mar. 2, 2011.

The radio 217 may comprise a processor 218 and an analog front-end (AFE) 219. The baseband processor 218 may comprise circuitry operable to interface with the AFE 219 to receive and transmit data, and to process received and to-be-transmitted data. In some instances, the baseband processor 218 may be substantially similar to the baseband processor 208. In instances that the device 102 is less-resource-constrained device, such as a base station or network controller, and the device 104 is a more-resource-constrained device, such as a battery-powered tag, the baseband processor 218 may be less-complex (e.g., comprise fewer gates, utilize less power, utilize less memory, etc.) than the baseband processor 208. In one embodiment, for example, the baseband processor 208 may be operable to implement more complex signal processing algorithms (e.g., FEC decoding) than the baseband processor 218.

The analog front-end (AFE) 209 may comprise circuitry suitable for processing received and/or to-be-transmitted data in the analog domain. For transmission, the AFE 209 may receive digital data from the baseband processor 208, process the data to generate corresponding RF signals, and output the RF signals to the antenna 210. For reception, the AFE 209 may receive RF signals from the antenna 210, process the RF signals to generate corresponding digital data, and output the digital data to the baseband processor 209. In some instances, the AFE 219 may be substantially similar to the AFE 209. In instances that the device 102 is less-resource-constrained device, such as a base station or network controller, and the device 104 is a more-resource-constrained device, such as a battery-powered tag, the AFE 219 may be less-complex (e.g., comprise fewer gates, utilize less power, utilize less memory, etc.) than the AFE 209. In one embodiment, for example, the AFE 209 may comprise a more-sensitive receiver, a more powerful transmitter than the AFE 219.

Circuitry of the memory 206 may comprise one or more memory cells and may be operable to store data to the memory cell(s) and read data from the memory cell(s). The one or more memory cell may comprise one or more volatile memory cells and/or one or more non-volatile memory cells. The memory 206 may store data arranged, for example, as an indexed short file block (ISFB) and/or indexed short file series block (ISFSB) as described in the above-incorporated U.S. Provisional Patent Application 61/464,376.

Circuitry of the memory 216 may comprise one or more memory cells and may be operable to read data from the memory cell(s) and/or store data to the memory cell(s). The memory 216 may store data arranged, for example, as an indexed short file block (ISFB) and/or indexed short file series block (ISFSB) as described in the above-incorporated U.S. Provisional Patent Application 61/464,376. In some instances, the memory 216 may be substantially similar to the memory 206. In instances that the device 104 is resource-constrained, the memory 216 may be less-complex (e.g., comprise fewer gates, utilize less power, etc.) than the memory 206.

Each of the clocks 211 and 221 may be operable to generate one or more oscillating signals which may be utilized to control synchronous circuitry of the device 100. The clock 211 may comprise, for example, one or more crystal oscillators, phase-locked loops, and/or direct digital synthesizers. The clock 211 may also comprise a “date/time” or “real-time” clock operable to keep track of time of day, day of week, day of month, month, and/or year.

The interfaces 212 and 222 may enable configuring and/or programming the devices 102 and 104, respectively. In an exemplary embodiment, one or more values of one or more timing parameters may be programmed via the programming interfaces 212 and/or 222.

Each of the antennas 210 and 220 may be operable to transmit and receive electromagnetic signals in one or more frequency bands. In an embodiment of the invention, the antennas 210 and 220 may be operable to transmit and receive signals in the ISM frequency band centered at 433.92 MHz.

In operation, the device 102 may send a request message which may be received by the device 104. The request message may comprise an N-bit search token and one or more threshold values. The device 104 may then search N-bit blocks of data in the memory 216 looking for a “match” for the search token. Just how similar the N-bit data needs to be to the search token may be determined by the received threshold value. For example, if the threshold value is N, then only an N-bit block of data exactly matching the search token would be a “match.” On the other hand, if the threshold value is 5, then any N-bit block of data in the memory that has 5 bits in common with the search token may be considered a “match.” The number of bits that an N-bit block of data has in common with the search token may be referred to as that block's search score.

In an exemplary embodiment, if more one or more matches for the search token are found in the memory 216, then the device 104 may send a response message to the device 102. The device 104 may, for example, send one or more matching blocks of data, and/or the scores associated with the matching blocks, to the device 102. The device 104 may prioritize the data and/or scores it sends to the device 102 in order of highest to lowest search score.

In an exemplary embodiment, if, when, and/or how the device 104 sends a response message to the device 102 may be determined based on the search score(s) that resulted from the search of the memory 216 for the received search token. For example, the device 104 may not respond to the request if none of the search scores are above the threshold value. Conversely, if one or more of the search scores are above the threshold, how soon the device 104 attempts to send a response and/or how aggressively the device 104 contends for access to the communication medium may depend on the search score associated with the message to be sent. For example, for a response message containing data with a relatively-higher search score, the device 104 may begin contending for access to the medium almost immediately after generating the search score and may contend for access for a relatively-longer period. Conversely, a for a response message containing data with a search score of less than N, the device 104 may delay contending for the medium and, once it does start contending for the medium, may do so for a relatively-shorter period of time. Additionally or alternatively, for a response message containing data with a relatively-higher search score, the device 104 may require the medium to be free for a relatively-shorter period of time before it begins transmitting the response. Conversely, for a response message containing data with a relatively-shorter search score, the device 104 may require the medium to be free for a relatively-longer period of time before it begins transmitting the response.

FIG. 2 is a diagram illustrating aspects of the invention taking place at different layers of the OSI model. As shown in FIG. 2, the device 104 may comprise: a congestion module 230 and/or a flow control module 232 which may operate at the transport layer (layer 4 of the OSI model); a carrier sense multiple access (CSMA) module 236 which may operate at the data link layer (layer 2 of the OSI model); and a received signal strength indicator (RSSI) module which may operate at the physical layer (layer 1 of the OSI model). The device 104 may also comprise a register 234 which may be accessible to and/or modifiable by the congestion control module 230, the flow control module 232, and/or the CSMA module 236.

In operation, the congestion control module 230 may receive timing parameters T_(CA0), T_(G), score, ch_list, and CSMA_options. The parameter T_(CA0) may correspond to the amount of time that the device 104 has to initiate transmission of the response message. That is, T_(CA0) may correspond to T_(C)−T_(resp), where T_(C) is the duration of the response window (the amount of time that the requesting device is going to listen for responses to the request message), and T_(resp) is the amount of time it will take the device 104 to transmit the response message. The parameter T_(G) may be an initial value for a parameter T_(G)′ which may determine how long the physical medium must be inactive before the device 104 begins transmitting on the medium. The parameter “score” may be the search score associated with the response message. The parameter ch_list may indicate onto which channel or channels the device 104 may attempt to transmit the response message. The congestion control module 230 may utilize ch_list to generate ch_lst′ which may be, for example, all or a subset of ch_list. One or more of the parameters T_(C), T_(G), score, CSMA_options, and ch_list may have been received in, and/or derived from information contained in, the request message. In this manner, the requesting device may control, at least in part, if, how, and/or when the responding device 104 transmits a response to the request.

The parameter CSMA_options may indicate whether to use carrier sense (i.e. “listen before talk”) and/or which equations and/or algorithms are utilized by the congestion control module 230 for calculating T_(CA) and/or T_(G)′. For example, for a first value of CSMA_options, T_(CA) may be set equal to T_(CA0), but for a second CSMA_options, T_(CA) may be set equal to T_(CA0)/2. In this regard, the congestion control module 230 may utilize the parameters T_(CA0), score, ch_list and/or CSMA_options to generate a value of T_(CA), which may be less than or equal to T_(CA0). After calculating T_(CA), the congestion control module 230 may store the value of T_(CA) in the register 234. Similarly, the congestion control module 230 may utilize the parameters T_(G), score, ch_list and/or CSMA_options for calculating T_(G)′.

Upon initialization from the congestion control module 230, the CSMA module 236 may perform CSMA as, for example, described below in reference to FIG. 4B. If an available channel is detected, the CSMA module 236 may assert TxEN and the congestion control module 204 may then manage the transmission of the response packet onto the medium on the available channel. Upon TxEN being asserted, the flow control module 232 may modify the value stored in the register 234. If, after trying for a period of time T_(CA), none of the channels in the channel list are determined to be available, then, depending on the value of T_(CA), the device 104 may abort transmission of the response or may take a break and try again later. For example, if the congestion control module sets T_(CA)=T_(CA0) then upon the CSMA failing to obtain access to the medium for a period of time T_(CA), the device 104 may abort transmission of the response message. Conversely, if T_(CA)<T_(CA0), then the congestion control module 230 may wait for a period of time T_(wait), and then trigger the CSMA module 236 to once again attempt to gain access to the medium. The second attempt may last for up to period of time equal to T_(CA0)−T_(CA)−T_(wait). The parameter T_(wait) may be calculated based on, for example, the parameters score, CSMA_options, T_(CA0), T_(CA), ch_list, T_(G), and/or T_(G)′.

FIG. 3 is a flowchart illustrating exemplary steps for query-based congestion control. In step 302, the device 104 may receive a request message from the device 102. In step 304, the device 104 may compare a search token contained in the request message to a block of data stored in the memory 216. The result of the comparison may be a score which indicates the similarity between the search token and the block of data. In an exemplary embodiment, the score may be generated via a correlation operation. In step 306, the score generated in step 304 may be compared to a threshold value. The threshold value may, for example, have been received in the request message and/or pre-configured in the device 104. If the score is below the threshold, then, in step 308, the device 104 may decide to discard the request and not send a response. If the score is above the threshold value, then the exemplary steps may advance to step 310.

In step 310, the device 104 may extract one or more timing parameters (e.g., one or more of the parameters T_(C), T_(G), CSMA_options, and ch_list discussed above with respect to FIG. 2) from the request message. In step 312, the device 104 may calculate one or more timing parameters based on the score generated in step 304 and/or based on the parameters recovered in step 310. The device 104 may, for example, calculate T_(CA) and T_(G)′ as described above with respect to FIG. 2.

FIGS. 4A and 4B are a flowchart illustrating the use of carrier sense multiple access (CSMA) for implementing query-based congestion control. Referring to FIG. 4A, the exemplary steps begin with step 402 in which the device 104 decides to respond to a received request message. In step 404, the congestion control module calculates a value of T_(CA) based on a search score associated with the response message to be transmitted and/or based on one or more other timing parameters. The calculated value of T_(CA) may then be stored to the register 234. In step 406, the congestion control module 230 may compare the value of T_(CA) to a threshold. If the value of T_(CA) is less than a threshold (i.e., the requesting device will cease listening before the complete response message can be transmitted) then in step 408, the device 104 may abort transmission of the response message.

Returning to step 406, if the value of T_(CA) is greater than the threshold, then, in step 410, the congestion control module 230 triggers the CSMA process performed by the CSMA module 236. In step 412, the CSMA process described below with respect to FIG. 4B may take place. In step 414, if transmission was successful (i.e., either CSMA was disabled or an available channel for transmitting the response message was detected during step 412), then the exemplary steps may advance to step 420. In step 420, the flow control module 232 may set the T_(CA) register 234 to a value guaranteed to be less than the threshold utilized in step 408. For example, the flow control module 232 may set the T_(CA) register 234 to a value of −1.

Returning to step 414, if the step 412 did not result in a successful transmission, then the exemplary steps may advance to step 416. In step 416, the congestion control module may count down an amount of time T_(wait). The value of T_(wait) may be calculated based on variety of parameters such as, for example, described above with respect to FIG. 2. In step 418, the value stored in the T_(CA) register 234 may be updated. In an exemplary embodiment, the value stored in the register 234 may be updated by subtracting off the amount of time that has elapsed since the value was calculated. In another exemplary embodiment, a new value of T_(CA) may be calculated based on one or more timing parameters, such as those described with respect to FIG. 2, and/or based on how much time is left in the response window (the time period of duration T_(C) during which the requesting device will listen for responses).

Referring now to FIG. 4B, in step 422, the CSMA module 236 may retrieve one or more parameters from the congestion control module 230 and/or retrieve the value of T_(CA) from the register 234. In step 426, if CSMA is disabled (i.e., the device 104 is configured to transmit onto the medium without first sensing whether another device is currently transmitting) then the steps advance to step 438. In step 438, the CSMA module 236 asserts TxEN. In step 440 the message is transmitted by the flow control module 232.

Returning to step 426, if CSMA is enabled, then in step 428, a variable I may be set to 1. In step 430, the physical layer receiver of the device 104 may be powered-up and configured to receive on the i^(th) channel identified by the parameter ch_list′. In step 432, the CSMA module 236 may detect whether CS from the physical layer receiver is asserted. The PHY may assert CS when the received signal strength is above a threshold. The threshold utilized by the RSSI module 238 may have been pre-configured by an administrator and/or configured dynamically based on, for example, past performance and/or based on information contained in the received request message. If CS is not asserted, then in step 434, the CSMA module 236 waits for a period of time equal to T_(G)′. In step 436, the CSMA module 236 again detects whether CS from the physical layer receiver is asserted. If CS is not asserted then, in step 438 the CSMA module 236 asserts TxEN. In step 440 the flow control module 232 manages the transmission of the response message onto the physical medium.

Returning to steps 432 and 436, if either of these steps detect that CS is asserted, then the exemplary steps advance to step 444. In step 444, the variable i is incremented by 1. In step 446, the value of T_(CA) in register 236 is updated by subtracting off the amount of time that has elapsed since the register was last programmed. In step 448, the updated value of T_(CA) is compared to a threshold (i.e. it is determined whether there would still be time to transmit the response message before the contention period ends). If T_(CA) is less than the threshold, then in step 452, TxEN remains deasserted and the steps advance to step 442. If T_(CA) is greater than or equal to the threshold, then in step 450 it is determined whether all channels in the channel list have been checked for availability. If not, then the exemplary steps return to step 430. If all channels have been checked, then the exemplary steps advance to step 452.

FIG. 4C is a flowchart illustrating query-based calculation of timing parameters for accessing a shared medium. The exemplary steps begin with step 460 after the device 104 has received a request message and is calculating a search score based on a search token received in the request message. In step 462, the device 104 may determine whether the search score is greater than a threshold plus a margin 2*Δ. If so, then in step 464, the congestion control module 230 may set T_(G)′ to T_(G)′₁ and set T_(CA) to T_(CA1).

Returning to step 462, if the search score is not greater than threshold+2Δ, then the steps advance to step 466. In step 466, the device 104 may determine whether the search score is greater than a threshold plus a margin Δ. If so, then in step 468, the congestion control module 230 may set T_(G)′ to T_(G)′₂ (where T_(G)′₂>T_(G)′₁) and set T_(CA) to T_(CA2) (where T_(CA2)<T_(CA1)).

Returning to step 466, if the search score is not greater than threshold+Δ, then the steps advance to step 470. In step 470, the device 104 may determine whether the search score is greater than the threshold. If so, then in step 472, the congestion control module 230 may set T_(G)′ to T_(G)′₃ (where T_(G)′₃>T_(G)′₂) and set T_(CA) to T_(CA3) (where T_(CA3)<T_(CA2)). Returning to step 470, if the search score is not greater than threshold, then the steps advance to step 474 and no response maybe transmitted.

FIGS. 5A-5E illustrate an exemplary dialog between network devices utilizing query-based congestion control.

In FIG. 5A, the device A is shown transmitting a request message which is received by both devices B and C.

In FIG. 5B the device B may calculate a search score of X and the device C may calculate a search score of Y, where X is a higher search score than Y.

In FIG. 5C, the device B may generate timing parameters based on the search score X and the device C may generate timing parameters based on the search score Y.

In FIG. 5D, based on the parameters generated in FIG. 5C, the device B may gain access to the medium before the device C gains access to the medium. Accordingly, the device B may transmit a response while the device C holds off transmitting its lower-scored response. Then, in FIG. 5E, the device C may transmit its response message.

In an exemplary embodiment of the invention, the electronic device 104 may comprise an interface (e.g., radio 207) operable to communicate over a physical medium and may be operable to regulate the transmission of a message onto the physical medium. The device 104 may access the medium in accordance with a carrier sense multiple access (CSMA) scheme, wherein one or more values of one or more CSMA parameters (e.g., ch_list, score, TG, TCA0, and/or CSMA_options) may be determined based on the result of a comparison of a received search token to data stored in the communication device. The message may be a response to a request message received via the communication interface, and the search token may have been received in the request message. A result of the comparison may be a score that indicates how similar the data is to the search token. One or more values of the one or more CSMA parameters may be determined based on the result of a comparison of the score and one or more thresholds. The one or more thresholds may have been received in the request message. The one or more values of the one or more of the CSMA parameters may be determined based on one or more initial values of the one or more CSMA parameters contained in the received request message.

The CSMA parameters may comprise a first parameter (e.g., TCA) corresponding to an amount of time that the device attempts to access the medium. An equation utilized for determining the first parameter may be selected from a plurality of equations based on the comparison of the data stored in the communication device and the search token. A relatively-higher similarity between the data and the search token may result in relatively-higher value of the first parameter, and a relatively-lower similarity between the data and the search token may result in a relatively-lower value of the first parameter. Additionally or alternatively, the CSMA parameters may comprise a second parameter corresponding to an amount of time that the medium must be free before transmitting the message onto the medium. A relatively-higher similarity between the data and the search token may result in relatively-lower value of the second parameter, and a relatively-lower similarity between the data and the search token may result in a relatively higher-value of the second parameter.

Other embodiments of the invention may provide a non-transitory computer readable medium and/or storage medium, and/or a non-transitory machine readable medium and/or storage medium, having stored thereon, a machine code and/or a computer program having at least one code section executable by a machine and/or a computer, thereby causing the machine and/or computer to perform the steps as described herein for query-based congestion control.

Accordingly, the present invention may be realized in hardware, software, or a combination of hardware and software. The present invention may be realized in a centralized fashion in at least one computing system, or in a distributed fashion where different elements are spread across several interconnected computing systems. Any kind of computing system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computing system with a program or other code that, when being loaded and executed, controls the computing system such that it carries out the methods described herein. Another typical implementation may comprise an application specific integrated circuit or chip.

The present invention may also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.

While the present invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the present invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims. 

What is claimed is:
 1. A method comprising: in an electronic device comprising a communication interface for communicating over a physical medium: determining one or more values of one or more CSMA parameters based on the result of a comparison of a received search token and data stored in said electronic device; ad regulating the transmission of a message onto said physical medium in accordance with a carrier sense multiple access (CSMA) scheme.
 2. The method of claim 1, wherein: said message is a response to a request message received via said communication interface; and said search token was received in said request message.
 3. The method of claim 2, wherein: a result of said comparison is a score that indicates how similar said data is to said search token; said determining of said one or more values of said one or more CSMA parameters is based on the result of a comparison of said score and one or more thresholds that were received in said request message.
 4. The method of claim 1, wherein: said message is a response to a request message received via said communication interface; and said determining of said one or more values of said one or more of said CSMA parameters is based on one or more initial values of said one or more CSMA parameters contained in said request message.
 5. The method of claim 1, wherein said CSMA parameters comprise a first parameter corresponding to an amount of time that said electronic device attempts to access said medium.
 6. The method of claim 5, wherein an equation utilized for determining said first parameter is selected from a plurality of equations based on said comparison of said data stored in said communication device and said search token.
 7. The method of claim 5, wherein a relatively-higher similarity between said data and said search token results in relatively-higher value of said first parameter, and a relatively-lower similarity between said data and said search token results in a relatively-lower value of said first parameter.
 8. The method of claim 1, wherein said CSMA parameters comprise a second parameter that corresponds to amount of time that said medium must be free before transmitting said message onto said medium.
 9. The method of claim 8, wherein a relatively-higher similarity between said data and said search token results in relatively-lower value of said second parameter, and a relatively-lower similarity between said data and said search token results in a relatively higher-value of said second parameter.
 10. A system comprising: an electronic device comprising a communication interface for communicating over a physical medium, said electronic device being operable to: determine one or more values of one or more CSMA parameters based on the result of a comparison of a received search token and data stored in said electronic device; and regulate the transmission of a message onto said physical medium in accordance with a carrier sense multiple access (CSMA) scheme.
 11. The system of claim 10, wherein: said message is a response to a request message received via said communication interface; and said search token was received in said request message.
 12. The system of claim 11, wherein: a result of said comparison is a score that indicates how similar said data is to said search token; said determining of said one or more values of said one or more CSMA parameters is based on the result of a comparison of said score and one or more thresholds that were received in said request message.
 13. The system of claim 10, wherein: said message is a response to a request message received via said communication interface; and said determining of said one or more values of said one or more of said CSMA parameters is based on one or more initial values of said one or more parameters contained in said request message.
 14. The system of claim 10, wherein said CSMA parameters comprise a first parameter corresponding to an amount of time that said electronic device attempts to access said medium.
 15. The system of claim 14, wherein an equation utilized for determining said first parameter is selected from a plurality of equations based on said comparison of said data stored in said electronic device and said search token.
 16. The system of claim 14, wherein a relatively-higher similarity between said data and said search token results in relatively-higher value of said first parameter, and a relatively-lower similarity between said data and said search token results in a relatively-lower value of said first parameter.
 17. The system of claim 10, wherein said CSMA parameters comprise a second parameter that corresponds to amount of time that said medium must be free before transmitting said message onto said medium.
 18. The system of claim 17, wherein a relatively-higher similarity between said data and said search token results in relatively-lower value of said second parameter, and a relatively-lower similarity between said data and said search token results in a relatively higher-value of said second parameter.
 19. A method performed by a communication device which communicates over a shared communication medium, the method comprising: determining values of one or more timing parameters based on the result of a comparison of a received search token and data stored in said communication device; and deciding when to transmit a message onto said shared communication medium based on detected activity on said shared communication medium and based on said one or more timing parameters.
 20. The method of claim 19, wherein: said message is a response to a previously-received message comprising a threshold value; a result of said comparison is a score that indicates how similar said data is to said search token; said one or more values of said timing parameters are determined based on the result of a comparison of said score and said threshold value. 